90 research outputs found
Some Results on incidence coloring, star arboricity and domination number
Two inequalities bridging the three isolated graph invariants, incidence
chromatic number, star arboricity and domination number, were established.
Consequently, we deduced an upper bound and a lower bound of the incidence
chromatic number for all graphs. Using these bounds, we further reduced the
upper bound of the incidence chromatic number of planar graphs and showed that
cubic graphs with orders not divisible by four are not 4-incidence colorable.
The incidence chromatic numbers of Cartesian product, join and union of graphs
were also determined.Comment: 8 page
Full edge-friendly index sets of complete bipartite graphs
‎‎Let be a simple graph‎. ‎An edge labeling induces a vertex labeling defined by for each ‎, ‎where is the additive group of order 2‎. ‎For ‎, ‎let‎ ‎ and ‎. ‎A labeling is called edge-friendly if‎ ‎‎. ‎ is called the edge-friendly index of under an edge-friendly labeling ‎. ‎The full edge-friendly index set of a graph is the set of all possible edge-friendly indices of ‎. ‎Full edge-friendly index sets of complete bipartite graphs will be determined‎
FULL EDGE-FRIENDLY INDEX SETS OF COMPLETE BIPARTITE GRAPHS
Abstract. Let G = (V, E) be a simple graph. An edge labeling f : E → {0, 1} induces a vertex labeling f is called the edge-friendly index of G under an edge-friendly labeling f . The full edge-friendly index set of a graph G is the set of all possible edge-friendly indices of G. Full edge-friendly index sets of complete bipartite graphs will be determined
On the Integer-antimagic Spectra of Non-Hamiltonian Graphs
Let be a nontrivial abelian group. A connected simple graph is -\textbf{antimagic} if there exists an edge labeling such that the induced vertex labeling , defined by , is a one-to-one map. In this paper, we analyze the group-antimagic property for Cartesian products, hexagonal nets and theta graphs
- …